Lecture 27: Graph Models
نویسندگان
چکیده
At the end of last lecture we introduced a very practical problem: how to generate a random graph with power law degree distribution. It turns out to be a nontrivial problem, so we will briefly look at several possible models here. In a random graph with a power law degree distribution, the expected number of degree k vertices is c n kα , where α is a parameter of the distribution (typically α ∈ [2, 3]), and c is a constant chosen so that these expectations over all k add up to the total number of vertices, i.e.
منابع مشابه
Lectures in mathematical neuroscience
Contents Lectures in mathematical neuroscience 1 Lecture 1. Single neuron models 3 1.1. Conductance–based models 3 1.2. Periodically forced neural oscillator 6 1.3. Integrate–and–fire models 13 Lecture 2. Synaptic and dendritic processing 23 2.1. Excitatory and inhibitory synapses 23 2.2. Kinetic model of a synapse 27 2.3. Dendritic filtering of synaptic inputs 31 2.4. Synaptic plasticity 34 Le...
متن کاملLecture Notes on Testing Graph Properties in the Dense Graph Model
Organization. The current lecture is the first out of a series of three lectures that cover three models for testing graph properties. In each model, we spell out the definition of property testing (when specialized to that model), present some of the known results, and demonstrate some of the ideas involved (by focusing on testing Bipartiteness, which seems a good benchmark). We start the curr...
متن کاملTwo-Level Boolean Minimization
mation and Management (AAIM), Portland, OR, USA, Lecture Notes in Computer Science, vol. 4508, pp. 399–410. Springer (2007) 12. Jiang, M.: A PTAS for the weighted 2-interval pattern problem over the preceding-and-crossing model. In: Y.X. A.W.M. Dress, B. Zhu (eds.) Proc. 1st Annual International Conference on Combinatorial Optimization and Applications (COCOA), Xi’an, China, Lecture Notes in Co...
متن کاملThree Lectures on Free Probability Jonathan Novak with Illustrations by Michael Lacroix
0. Introduction 2 1. Lecture One: Discovering the Free World 2 1.1. Counting connected graphs 2 1.2. Cumulants and connectedness 4 1.3. Cumulants and independence 7 1.4. Central Limit Theorem by cumulants 9 1.5. Geometrically connected graphs 10 1.6. Non-crossing cumulants 12 1.7. Non-crossing independence 19 1.8. The medium is the message 21 1.9. A brief history of the free world 22 2. Lecture...
متن کاملErdös-Rényi Random Graphs: The Giant Component
Recall that all the “Real-World” graphs we examined in Lecture 2 had one component containing a large constant fraction of the vertices. The second-largest component was smaller by many orders of magnitude. This property is shared by Erdös-Rényi random graphs and by many other graph models. In this lecture, we will see (mostly) why Erdös-Rényi random graphs have this property. The large compone...
متن کامل